Extending Regular Expressions with Duration Constraints for Modelling and Verifying Hybrid Systems

نویسندگان

  • Li Xuandong
  • Zheng Tao
چکیده

In this paper, we introduce the formalism of duration-constrained regular expressions to model real-time and hybrid systems, which is an extension of regular expressions with duration constraints. It is equivalent in expressive power to a class of linear hybrid automata called loop-closed automata in which any variable tested in a loop is reset or tested to exact values in the same loop. Based on duration-constrained regular expressions, we give the basic idea to attack some veri cation problems of loop-closed automata, and show some results we have gotten.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

متن کامل

Extending Storage Duration of Mother Scales for Enlarging Scale Bulblets and Soluble Carbohydrates Content in Lily “Arabian Red”

Oriental hybrid lily “Arabian Red” mother scales were stored in moist cocopeat and perlite (1:1) for 3 or 5 months at 25 ̊C. The numbers of scale bulblets per mother scale were nearly identical in two durations. Increasing storage duration promoted the growth of roots (number and length) and No. scales per scale bulblets. And, diameters of scale bulblets were more in longer storage duration (5 m...

متن کامل

Checking Linear Duration Invariants by Linear Programming

In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...

متن کامل

Simplification of a Petri Net controller in industrial systems

This paper deals with the problem of forbidden states in discrete event systems modeled by Petri Net. To avoid the forbidden states, some constraints which are called Generalized Mutual Exclusion Constraints can be assigned to them. Enforcing these constraints on the system can be performed using control places. However, when the number of these constraints is large, a large number of control p...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998